Manger's Attack Revisited
نویسنده
چکیده
In this work we examine a number of different open source implementations of the RSA Optimal Asymmetric Encryption Padding (OAEP) and generally RSA with respect to the message-aimed timing attack introduced by James Manger in CRYPTO 2001. We show the shortcomings concerning the countermeasures in two libraries for personal computers, and address potential flaws in previously proposed countermeasures. Furthermore, we point out a new source of timing differences that has not been addressed previously. We also investigate a new class of related problems in the multi-precision integer arithmetic that in principle allows a variant of Manger’s attack to be launched against RSA implementations on 8-bit and possibly 16-bit platforms.
منابع مشابه
A claim in search of evidence: reply to Manger's thermogenesis hypothesis of cetacean brain structure.
In a recent publication in Biological Reviews, Manger (2006) made the controversial claim that the large brains of cetaceans evolved to generate heat during oceanic cooling in the Oligocene epoch and not, as is the currently accepted view, as a basis for an increase in cognitive or information-processing capabilities in response to ecological or social pressures. Manger further argued that dolp...
متن کاملBauer-Berson-Feiertag attack revisited
We show that Shoup and Rubin’s protocols are not secure against the BBF attack proposed by Bauer, Berson, and Feiertag, and propose an amendment. Furthermore, our results indicate that both Bellare and Rogaway’s security and Paulson’s security do not imply the security against the BBF attack.
متن کاملFunctional Graph Revisited: Updates on (Second) Preimage Attacks on Hash Combiners
This paper studies functional-graph-based (second) preimage attacks against hash combiners. By exploiting more properties of cyclic nodes of functional graph, we find an improved preimage attack against the XOR combiner with a complexity of 2, while the previous best-known complexity is 2. Moreover, we find the first generic second-preimage attack on Zipper hash with an optimal complexity of 2.
متن کاملState recovery of RC4 and Spritz Revisited
We provide an improved complexity analysis of backtracking-based state recovery attacks on RC4 and Spritz. Comparing new estimates with known results on Spritz, our analysis shows a signi cantly lower complexity estimate for simple state recovery attack as well as special state recovery attack. We validated the estimates by performing experiments for selected feasible parameters. We also propos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010